Search results for "Bit field"

showing 1 items of 1 documents

Multiple Usage of Random Bits in Finite Automata

2012

Finite automata with random bits written on a separate 2-way readable tape can recognize languages not recognizable by probabilistic finite automata. This shows that repeated reading of random bits by finite automata can have big advantages over one-time reading of random bits.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordFinite-state machineTheoretical computer scienceKolmogorov complexityComputer scienceω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesBit fieldTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESsymbolsQuantum finite automataAutomata theoryArithmeticComputer Science::DatabasesComputer Science::Formal Languages and Automata Theory
researchProduct